#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e3+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
char str[maxn];
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL t;cin>>t;
   while(t--){
        LL n;cin>>n;
        cin>>(str+1);
        LL res=0;
        for(LL i=1;i<=n;i++){
            if(str[i]=='0') res++;
        }
        if(res==1){
            cout<<"BOB"<<"\n";
            continue;
        }
        if(res==0){
             cout<<"DRAW"<<"\n";
             continue;
        }
        if(n&1){
            if(str[(n+1)/2]=='0'){
                if(res==2){
                    cout<<"DRAW"<<"\n";
                }
                else cout<<"ALICE"<<"\n";
            }
            else cout<<"BOB"<<"\n";
        }
        else cout<<"BOB"<<"\n";
   }
   return 0;
}
